A dynamic programming approach to the approximation of nonlinear L2-gain
نویسندگان
چکیده
Abstract— A generalization of the L2-gain inequality based on nonlinear gains is considered. Using optimization and dynamic programming to characterize lower bounds for the minimal gain function for which this nonlinear L2-gain inequality holds, a technique for computation of nonlinear L2gain bounds is proposed. Some simple illustrative examples are explored.
منابع مشابه
A max-plus approach to the approximation of transient bounds for systems with nonlinear L2-gain
The notion of nonlinear L2-gain is a natural generalization of the extensively studied conventional (linear) L2-gain property that finds application in stability analysis and H∞-control for nonlinear systems. As in the conventional formulation, notions of transient and gain bounds play an integral role in the statement of the property as an input / output inequality. These bounds summarize an i...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملClose interval approximation of piecewise quadratic fuzzy numbers for fuzzy fractional program
The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We pro...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملStudy on multi-objective nonlinear programming in optimization of the rough interval constraints
This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems. All of the lower and upper approximatio...
متن کامل